منابع مشابه
Graphs with 3-rainbow index n-1 and n-2
Let G = (V (G), E(G)) be a nontrivial connected graph of order n with an edge-coloring c : E(G) → {1, 2, . . . , q}, q ∈ N, where adjacent edges may be colored the same. A tree T in G is a rainbow tree if no two edges of T receive the same color. For a vertex set S ⊆ V (G), a tree connecting S in G is called an S-tree. The minimum number of colors that are needed in an edge-coloring of G such t...
متن کاملGraphs with 4-rainbow index 3 and n-1
Let G be a nontrivial connected graph with an edge-coloring c : E(G) → {1, 2, . . . , q}, q ∈ N, where adjacent edges may be colored the same. A tree T in G is called a rainbow tree if no two edges of T receive the same color. For a vertex set S ⊆ V (G), a tree that connects S in G is called an S-tree. The minimum number of colors that are needed in an edge-coloring of G such that there is a ra...
متن کامل2-rainbow domination in generalized Petersen graphs P(n, 3)
Assume we have a set of k colors and we assign an arbitrary subset of these colors to each vertex of a graph G. If we require that each vertex to which an empty set is assigned has in its neighborhood all k colors, then this assignment is called a k-rainbow dominating function of G. The corresponding invariant γrk(G), which is the minimum sum of numbers of assigned colors over all vertices of G...
متن کاملSynthesis of N, N΄3, 4-Dialkylamino-1, 2, 5-Oxadiazoles
N, N΄-3, 4-di(methylamino)-1, 2, 5-oxadiazole (1f) was prepared by dehydration of N, N΄-3, 4-di(methylamino)glyoxime (2f) in aqueous potassium hydroxid at 170-180 ˚C. Under similar conditions N, N΄-3, 4-di(benzylamino)-1, 2, 5-oxadiazole (1c) and N, N΄-3, 4-di(isopropylamino)...
متن کاملThe largest Hosoya index of (n, n+1)-graphs
The Hosoya index of a graph is defined as the total number of its matchings. In this paper, we obtain that the largest Hosoya index of (n, n+1)-graphs is f (n+1)+f (n−1)+2f (n−3), where f (n) is the nth Fibonacci number, and we characterize the extremal graphs. © 2008 Elsevier Ltd. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2015
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.1783